Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Computing Minimum Cuts by Randomized Search Heuristics
نویسندگان
چکیده
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimization problems that occur as crucial subproblems in many real-world optimization problems and have a variety of applications in several different areas. We prove that there exist instances of the minimum s-t-cut problem that cannot be solved by standard single-objective evolutionary algorithms in reasonable time. On the other hand, we develop a bicriteria approach based on the famous MaxFlowMinCut Theorem that enables evolutionary algorithms to find an optimum solution in expected polynomial time.
منابع مشابه
Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On the Size of Weights in Randomized Search Heuristics
Runtime analyses of randomized search heuristics for combinatorial optimization problems often depend on the size of the largest weight. We consider replacing the given set of weights with smaller weights such that the behavior of the randomized search heuristic does not change. Upper bounds on the size of the new, equivalent weights allow us to obtain upper bounds on the expected runtime of su...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On the Design and Analysis of Evolutionary Algorithms
Evolutionary algorithms are problem-independent randomized search heuristics. It is discussed when it is useful to work with such algorithms and it is argued why these search heuristics should be analyzed just as all other deterministic and randomized algorithms. Such an approach is started by analyzing a simple evolutionary algorithm on linear functions, quadratic functions, unimodal functions...
متن کاملDesign and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods
Occasionally there have been long debates on whether to use elitist selection or not. In the present paper the simple (1,λ) EA and (1+λ) EA operating on {0, 1}n are compared by means of a rigorous runtime analysis. It turns out that only values for λ that are logarithmic in n are interesting. An illustrative function is presented for which newly developed proof methods show that the (1,λ) EA—wh...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Dynamic Parameter Control in Simple Evolutionary Algorithms
Evolutionary algorithms are general, randomized search heuristics that are influenced by many parameters. Though evolutionary algorithms are assumed to be robust, it is well-known that choosing the parameters appropriately is crucial for success and efficiency of the search. It has been shown in many experiments, that non-static parameter settings can be by far superior to static ones but theor...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
Randomized search heuristics like local search, tabu search, simulated annealing or all kinds of evolutionary algorithms have many applications. However, for most problems the best worst-case expected run times are achieved by more problem-specific algorithms. This raises the question about the limits of general randomized search heuristics. Here a framework called black-box optimization is dev...
متن کامل